On the Algebraic Immunity of Symmetric Boolean Functions

نویسندگان

  • An Braeken
  • Bart Preneel
چکیده

In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient algorithm for computing the algebraic immunity of a symmetric function. The existence of several symmetric functions with maximum algebraic immunity is proven. In this way, a new class of function which have good implementation properties and maximum algebraic immunity is found. We also investigate the existence of symmetric functions with high nonlinearity and reasonable order of algebraic immunity. Finally, we give suggestions how to use symmetric functions in a stream cipher.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Construction of Even-variable Rotation Symmetric Boolean Functions with Optimum Algebraic Immunity

The rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used as components of different cryptosystems. In order to resist algebraic attacks, Boolean functions should have high algebraic immunity. This paper studies the construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity. We construct ( / 4 3) n    ...

متن کامل

Lower Bounds on Algebraic Immunity of Boolean Functions

In the recently developed algebraic attacks applying to block and stream ciphers([1-5]), the concept of algebraic immunity (AI) is introduced in [6] and studied in [6-14]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symm...

متن کامل

Lower Bounds on the Algebraic Immunity of Boolean Functions

From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of algebraic immunity (AI) of a Boolean function was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on the algebraic immunity of Boolean functions. The results...

متن کامل

Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$

In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...

متن کامل

Construction of Rotation Symmetric Boolean Functions with optimal Algebraic Immunity Construcción de Funciones Booleanas de Rotación Simétrica con Inmunidad Algebraica Óptima

In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with the maximum possible algebraic immunity. To get high nonlinearity, we generalize our construction to a search technique in the RSBF class. We present RSBFs with the maximum algebraic immunity and high nonlinearity for odd number of variables. We also study the RSBF...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005